منابع مشابه
Designs from Paley Graphs and Peisert Graphs
Fix positive integers p, q, and r so that p is prime, q = p, and q ≡ 1 (mod 4). Fix a graph G as follows: If r is odd or p 6≡ 3 (mod 4), let G be the qvertex Paley graph; if r is even and p ≡ 3 (mod 4), let G be either the q-vertex Paley graph or the q-vertex Peisert graph. We use the subgraph structure of G to construct four sequences of 2-designs, and we compute their parameters. Letting k4 d...
متن کاملPaley graphs have Hamilton decompositions
We prove that all Paley graphs can be decomposed into Hamilton cycles.
متن کاملRandom Graphs in a Neural Computation Model
We examine in this work the following graph theory problem that arises in neural computations that involve the learning of boolean expressions by studying the asymptotic connectivity properties of Gn,1/(kn)1/2 random graphs, where k is a fixed positive integer. For an undirected graph G = (V,E) let N(X,Y ) = {v ∈ V − (X ∪ Y ) | ∃x ∈ Xwith (v, x) ∈ E}. For fixed k construct an undirected graph G...
متن کاملRigidity and separation indices of Paley graphs
It is shown that the ratio between separation and rigidity indices of graphs may be arbitrarily large. Paley graphs are such examples.
متن کاملSome strongly regular graphs with the parameters of Paley graphs
We construct two-intersection sets in PG(5, q), q odd, admitting PSL(2, q), whose associated strongly regular graphs have the same parameters as, but are not isomorphic to, Paley graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2016
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2015.12.009